#pragma GCC optimize(2)
#include <iostream>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#define F first
#define S second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
const int N=35;
int a[N],cnt;
void div(int n){
	while(n){
		a[++cnt]=n%2;
		n/=2;
	}
}
int main(){
	int n;
	scanf("%d",&n);
	div(n);
	for(int i=cnt;i>=1;i--)
		printf("%d",a[i]);
	return 0;
}

